Identication-Robust Subvector Inference
نویسنده
چکیده
This paper introduces identi cation-robust subvector tests and con dence sets (CSs) that have asymptotic size equal to their nominal size and are asymptotically e¢ cient under strong identi cation. Hence, inference is as good asymptotically as standard methods under standard regularity conditions, but also is identi cation robust. The results do not require special structure on the models under consideration, or strong identi cation of the nuisance parameters, as many existing methods do. We provide general results under high-level conditions that can be applied to moment condition, likelihood, and minimum distance models, among others. We verify these conditions under primitive conditions for moment condition models. In another paper, we do so for likelihood models. The results build on the approach of Chaudhuri and Zivot (2011), who introduce a C( )-type Lagrange multiplier test and employ it in a Bonferroni subvector test. Here we consider two-step tests and CSs that employ a C( )-type test in the second step. The two-step tests are closely related to Bonferroni tests, but are not asymptotically conservative and achieve asymptotic e¢ ciency under strong identi cation. Keywords: Asymptotics, con dence set, identi cation-robust, inference, instrumental variables, moment condition, robust, test. JEL Classi cation Numbers: C10, C12. The author gratefully acknowledges the research support of the National Science Foundation via grant SES1355504. The author thanks Koohyun Kwon for constructing the gures and Jaewon Lee for a very careful proofreading of the paper. The author thanks Isaiah Andrews, Angelo Melino, Charlie Saunders, and Katsumi Shimotsu for helpful comments.
منابع مشابه
Robust speech recognition over mobile networks using combined weighted viterbi decoding and subvector based error concealment
Robustness against transmission errors is one of the primary barriers to the widespread application of automatic speech recognition (ASR) in mobile communications. We have previously proposed a subvector based error concealment (EC) method that conducts error detection and mitigation in the feature-domain at the subvector level. This paper presents a weighted Viterbi decoding (WVD) algorithm th...
متن کاملSUPPLEMENT TO GMM ESTIMATION AND UNIFORM SUBVECTOR INFERENCE WITH POSSIBLE IDENTIFICATION FAILURE By
متن کامل
Identication robust inference in multivariate reduced rank regression and factor models
We propose identi cation robust inference methods for multivariate reduced rank (MRR) regressions. Such models involve nonlinear restrictions on the coe¢ cients of a multivariate linear regression (MLR), whose identi cation may raise serious non-regularities leading to the failure of standard asymptotics. To circumvent such problems, we propose con dence set estimates for parameters of interest...
متن کاملIdentication Robust Inference in Cointegrating Regressions
In cointegrating regressions, available estimators and test statistics are nuisance parameter dependent. This paper addresses this problem as an identi cation failure. We focus on set estimation of long-run coe¢ cients (denoted ). We check whether and to what degree popular estimation methods, speci cally the Maximum Likelihood of Johansen (1995), Fully Modi ed OLS [Phillips and Hansen (1990); ...
متن کاملGmm Estimation and Uniform Subvector Inference with Possible Identification Failure By
This paper determines the properties of standard generalized method of moments (GMM) estimators, tests, and confidence sets (CSs) in moment condition models in which some parameters are unidentified or weakly identified in part of the parameter space. The asymptotic distributions of GMM estimators are established under a full range of drifting sequences of true parameters and distributions. The...
متن کامل